The Design of the CADE-16 Inductive Theorem Prover Contest
نویسندگان
چکیده
"Progress in science is only achieved through careful analysis of methods and their power. Designing without analysis is idle speculation. lmplementatzon without analysis is tinkering. Alone they have no research value. All too often we read of major pieces of Al work that stop with the engineering steps. But we need to know how the zrnplemented program embodies the designs and that the program works well because of the design." B.G. Buchanan [Bu88]
منابع مشابه
Automated Cyclic Entailment Proofs in Separation Logic
We present a general automated proof procedure, based upon cyclic proof, for inductive entailments in separation logic. Our procedure has been implemented via a deep embedding of cyclic proofs in the HOL Light theorem prover. Experiments show that our mechanism is able to prove a number of non-trivial entailments involving inductive predicates.
متن کاملSaturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
A resolution theorem prover for intuitionistic logic p. 2 Proof-terms for classical and intuitionistic resolution p. 17 Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification p. 32 Extensions to a generalization critic for inductive proof p. 47 Learning domain knowledge to improve theorem proving p. 62 Patching faulty conjectures p. 77 Internal analogy i...
متن کاملAutomated Theorem Proving in a Simple Meta-Logic for LF
Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a meta-logic M2 which allows inductive reasoning over such LF encodings, and describe its implementation in Twelf, a special-purpose au...
متن کاملAn Embedding of Ruby in Isabelle
This paper describes a semantical embedding of the relation based language Ruby in Zermelo-Fraenkel set theory (ZF) using the Isabelle theorem prover. A small subset of Ruby, called Pure Ruby, is embedded as a conservative extension of ZF and many useful structures used in connection with VLSI design are deened in terms of Pure Ruby. The inductive package of Isabelle is used to characterise the...
متن کاملPARTHEO: A High-Performance Parallel Theorem Prover
PARTHEO, a sound and complete or-parallel theorem prover for rst order logic is presented. The proof calculus is model elimination. PARTHEO consists of a uniform network of sequential theorem provers communicating via message passing. Each sequential prover is implemented as an extension of Warren's abstract machine. PARTHEO is written in parallel C and running on a network of 16 transputers. T...
متن کامل